Approximating Sets of Symmetric and Positive-Definite Matrices by Geodesics
نویسندگان
چکیده
منابع مشابه
Approximating Sets of Symmetric and Positive-Definite Matrices by Geodesics
We formulate a generalized version of the classical linear regression problem on Riemannian manifolds and derive the counterpart to the normal equations for the manifold of symmetric and positive definite matrices, equipped with the only metric that is invariant under the natural action of the general linear group.
متن کاملDDtBe for Band Symmetric Positive Definite Matrices
We present a new parallel factorization for band symmetric positive definite (s.p.d) matrices and show some of its applications. Let A be a band s.p.d matrix of order n and half bandwidth m. We show how to factor A as A =DDt Be using approximately 4nm2 jp parallel operations where p =21: is the number of processors. Having this factorization, we improve the time to solve Ax = b by a factor of m...
متن کاملCharacterizing and approximating eigenvalue sets of symmetric interval matrices
We consider the eigenvalue problem for the case where the input matrix is symmetric and its entries perturb in some given intervals. We present a characterization of some of the exact boundary points, which allows us to introduce an inner approximation algorithm, that in many case estimates exact bounds. To our knowledge, this is the first algorithm that is able to guarantee exactness. We illus...
متن کاملScaling-Rotation Distance and Interpolation of Symmetric Positive-Definite Matrices
We introduce a new geometric framework for the set of symmetric positive-definite (SPD) matrices, aimed at characterizing deformations of SPD matrices by individual scaling of eigenvalues and rotation of eigenvectors of the SPD matrices. To characterize the deformation, the eigenvalue-eigenvector decomposition is used to find alternative representations of SPD matrices and to form a Riemannian ...
متن کامل"Compress and eliminate" solver for symmetric positive definite sparse matrices
We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in. The systems that have efficient compression of the fill-in mostly arise from discretization of partial differential equations. We show that the resulting fa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Conference Papers in Mathematics
سال: 2013
ISSN: 2314-4777
DOI: 10.1155/2013/425608